Water-Filling for Watermarking?
نویسنده
چکیده
In this paper we address the question: Is water-filling appropriate for watermarking? The water-filling paradigm is a traditional solution to the capacity maximization of parallel zero-mean additive white Gaussian channels subject to a signal energy constraint. In this work, we take an information theoretic approach to analyze the watermark communication problem in the presence of perceptual coding. Our effective watermark channel is modeled as a set of parallel independent zero-mean uniformly distributed additive noise channels. Energy allocation principles are identified to maximize the capacity results. Our findings are compared to the traditional water-filling solution and shed light on strategies to maximize the data hiding rate in the presence of compression.
منابع مشابه
Energy Allocation for High-Capacity Watermarking in the Presence of Compression
In this work, we take an information theoretic approach to analyze the watermark communication problem in the presence of perceptual coding. Our effective watermark channel is modeled as a set of parallel independent zero-mean uniformly distributed additive noise channels. Energy allocation principles are identified to maximize the capacity results. Our findings are compared to the traditional ...
متن کاملOptimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling
This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...
متن کاملWatermarking Scheme Based on Multiple Chaotic Maps
a watermarking scheme for Grayscale image isproposed based on a family of the chaotic maps and discretecosine transform. Jacobian Elliptic mapis employed to encrypt ofwatermarked logo. Piecewise nonlinear chaotic map is also usedto determine the location of DCT coefficients for the watermarkembedding. The purpose of this algorithm is to improve theshortcoming of watermarking such as small key s...
متن کاملIntroducing Capacity Surface to Estimate Watermarking Capacity
One of the most important parameters in evaluating a watermarking algorithm is its capacity. Generally, watermarking capacity is expressed by bits per pixel (bpp) unit measure. But this measure does not show what the side effects would be on image quality, watermark robustness and capacity. In this paper we propose a three dimensional measure named Capacity surface which shows the effects of ca...
متن کاملProposing an effective approach for Network security and multimedia documents classically using encryption and watermarking
Local binary pattern (LBP) operators, which measure the local contrast within a pixel's neighborhood, successfully applied to texture analysis, visual inspection, and image retrieval. In this paper, we recommend a semi blind and informed watermarking approach. The watermark has been built from the original image using Weber Law. The approach aims is to present a high robustness and imperceptibi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000